The Cryptographic Properties of Von Neumann Cellular Automata

Hamming Distance and Data Compression of 1-D CA

In this paper an application of von Neumann correction technique to the output string of some chaotic rules of 1-D Cellular Automata that are unsuitable for cryptographic pseudo random number generation due to their non uniform distribution of the binary elements is presented. The one dimensional (1-D) Cellular Automata (CA) Rule space will be classified by the time run of Hamming Distance (HD)...

Reiter’s Properties for the Actions of Locally Compact Quantum Goups on von Neumann Algebras

Calculating Different Topological Indices of Von Neumann Regular Graph of Z_(p^α )

By the Von Neumann regular graph of R, we mean the graph that its vertices are all elements of R such that there is an edge between vertices x,y if and only if x+y is a von Neumann regular element of R, denoted by G_Vnr (R). For a commutative ring R with unity, x in R is called Von Neumann regular if there exists x in R such that a=a2 x. We denote the set of Von Neumann regular elements by V nr...

Signal crossing solutions in von Neumann self-replicating cellular automata

Signal crossing is a significant problem within von Neumann cellular automata (29-states); only three solutions are known. This paper gives a thorough examination of these three solutions, including discussion of performance and the effective means of construction, including the mechanism of autoinitialisation. Application of these solutions within self-replicators is then examined for Nobili a...

Stream cipher using two dimensional Cellular Automata

The pseudo-random early in cryptography systems, the important of cellular automata has properties which are considered a state machine, high periods. two–dimensional cellular automata was used to avoid the limitation of the generated periods in the pseudo-random binary sequences such that used in linear shift Feedback registers (LFSR) , the binary sequences that are generated form CA generator...